Path decomposition

Results: 318



#Item
21CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The

CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () Midterm Review SessionNote that these solutions are compact and only provide the key ideas in answer of the question. The

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-03-23 01:44:18
22CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

CME 305: Discrete Mathematics and Algorithms Instructor: Reza Zadeh () HW#3 – Due at the beginning of class ThursdayConsider a model of a nonbipartite undirected graph in which two partic

Add to Reading List

Source URL: stanford.edu

Language: English - Date: 2015-03-23 01:42:05
23Overcoming the Scalability Challenges of Epidemic Simulations on Blue Waters Jae-Seung Yeom1,2 , Abhinav Bhatele3 , Keith Bisset2 , Eric Bohm4 , Abhishek Gupta4 , Laxmikant V. Kale4 , Madhav Marathe1,2 , Dimitrios S. Nik

Overcoming the Scalability Challenges of Epidemic Simulations on Blue Waters Jae-Seung Yeom1,2 , Abhinav Bhatele3 , Keith Bisset2 , Eric Bohm4 , Abhishek Gupta4 , Laxmikant V. Kale4 , Madhav Marathe1,2 , Dimitrios S. Nik

Add to Reading List

Source URL: charm.cs.illinois.edu

Language: English - Date: 2014-04-30 12:58:06
24Monotony Properties of Connected Visible Graph Searching Pierre Fraigniaud∗ Nicolas Nisse∗

Monotony Properties of Connected Visible Graph Searching Pierre Fraigniaud∗ Nicolas Nisse∗

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2007-01-17 10:04:51
25Distance Estimation and Object Location via Rings of Neighbors ∗ Aleksandrs Slivkins† February 2005 Revised: June 2005, Nov 2005, April 2006, SeptAbstract

Distance Estimation and Object Location via Rings of Neighbors ∗ Aleksandrs Slivkins† February 2005 Revised: June 2005, Nov 2005, April 2006, SeptAbstract

Add to Reading List

Source URL: research.microsoft.com

Language: English - Date: 2006-09-17 17:37:38
26An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email:

An Upper Bound on Checking Test Complexity for Almost All Cographs Oleg V. Zubkov Department of Computer Science East-Siberian State Academy of Education Irkutsk, Russia Email:

Add to Reading List

Source URL: www.mpi-sws.org

Language: English - Date: 2013-02-11 10:36:14
27Graph Reconstruction via Distance Oracles Claire Mathieu and Hang Zhou ´ Ecole Normale Sup´ erieure de Paris, France

Graph Reconstruction via Distance Oracles Claire Mathieu and Hang Zhou ´ Ecole Normale Sup´ erieure de Paris, France

Add to Reading List

Source URL: www.normalesup.org

Language: English - Date: 2014-01-18 08:40:19
28Universal Augmentation Schemes Navigability: √ for Network ∗ Overcoming the n-Barrier Pierre Fraigniaud

Universal Augmentation Schemes Navigability: √ for Network ∗ Overcoming the n-Barrier Pierre Fraigniaud

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2007-02-16 13:50:20
29On the Searchability of Small-World Networks ∗ with Arbitrary Underlying Structure Pierre Fraigniaud  George Giakkoupis

On the Searchability of Small-World Networks ∗ with Arbitrary Underlying Structure Pierre Fraigniaud George Giakkoupis

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2010-04-12 08:36:01
30Distributed Chasing of Network Intruders L´elia Blin1 , Pierre Fraigniaud2 , Nicolas Nisse2 , and Sandrine Vial1 1 2

Distributed Chasing of Network Intruders L´elia Blin1 , Pierre Fraigniaud2 , Nicolas Nisse2 , and Sandrine Vial1 1 2

Add to Reading List

Source URL: www.liafa.jussieu.fr

Language: English - Date: 2007-01-17 10:04:46